Hierarchical Pairwise Data
نویسنده
چکیده
Partitioning a data set and extracting hidden structure arises in diierent application areas of pattern recognition, data analysis and image processing. We formulate data clustering for data characterized by pairwise dissimilarity values as an assignment problem with an objective function to be minimized. An extension to tree{structured clustering is proposed which allows a hierarchical grouping of data. Deterministic annealing algorithms are derived for uncon-strained and tree{structured pairwise clustering.
منابع مشابه
Determination of weight vector by using a pairwise comparison matrix based on DEA and Shannon entropy
The relation between the analytic hierarchy process (AHP) and data envelopment analysis (DEA) is a topic of interest to researchers in this branch of applied mathematics. In this paper, we propose a linear programming model that generates a weight (priority) vector from a pairwise comparison matrix. In this method, which is referred to as the E-DEAHP method, we consider each row of the pairwise...
متن کاملHierarchical ordering with partial pairwise hierarchical relationships on the macaque brain data sets
Hierarchical organizations of information processing in the brain networks have been known to exist and widely studied. To find proper hierarchical structures in the macaque brain, the traditional methods need the entire pairwise hierarchical relationships between cortical areas. In this paper, we present a new method that discovers hierarchical structures of macaque brain networks by using par...
متن کاملProviding structural bias for hierarchical clustering
Constrained clustering received a lot of attention in the last years. However, the widely used pairwise constraints are not generally applicable for hierarchical clustering, where the goal is to derive a cluster hierarchy instead of a flat partition. Therefore, we propose for the hierarchical setting—based on the ideas of pairwise constraints—the use of must-link-before (MLB) constraints. In th...
متن کاملHierarchical Clustering using Randomly Selected Similarities
The problem of hierarchical clustering items from pairwise similarities is found across various scientific disciplines, from biology to networking. Often, applications of clustering techniques are limited by the cost of obtaining similarities between pairs of items. While prior work has been developed to reconstruct clustering using a significantly reduced set of pairwise similarities via adapt...
متن کاملA Stability Based Method for Discovering Structure in Clustered Data
We present a method for visually and quantitatively assessing the presence of structure in clustered data. The method exploits measurements of the stability of clustering solutions obtained by perturbing the data set. Stability is characterized by the distribution of pairwise similarities between clusterings obtained from sub samples of the data. High pairwise similarities indicate a stable clu...
متن کامل